Hamiltonian circuits on simple 3-polytopes
نویسندگان
چکیده
منابع مشابه
On pedigree polytopes and Hamiltonian cycles
In this paper we define a combinatorial object called a pedigree, and study the corresponding polytope, called the pedigree polytope. Pedigrees are in one-to-one correspondence with the Hamiltonian cycles on Kn. Interestingly, the pedigree polytope seems to differ from the standard tour polytope, Qn with respect to the complexity of testing whether two given vertices of the polytope are nonadja...
متن کاملOn polytopes simple in edges
In this paper, we will study the h-vectors of a slightly more general class of polytopes. A d-polytope is called simple in edges if each its edge is incident exactly to d − 1 facets. We will prove that for any polytope simple in edges all numbers h[d/2], h[d/2]+1,. . ., hd are nonnegative and hk 6 hd−k for k 6 d/2. Polytopes simple in edges appear for instance as (closures of) fundamental polyh...
متن کاملA note on Hamiltonian circuits
Proof. Let G satisfy the hypothesis of Theorem 1. Clearly, G contains a circuit ; let C be the longest one . If G has no Hamiltonian circuit, there is a vertex x with x ~ C . Since G is s-connected, there are s paths starting at x and terminating in C which are pairwise disjoint apart from x and share with C just their terminal vertices x l, X2, . . ., x s (see [ 11, Theorem 1) . For each i = 1...
متن کاملHamiltonian Submanifolds of Regular Polytopes
This work is set in the field of combinatorial topology, a mathematical field of research in the intersection of the fields of topology, geometry, polytope theory and combinatorics. This work investigates polyhedral manifolds as subcomplexes of the boundary complex of a regular polytope. Such a subcomplex is called k-Hamiltonian, if it contains the full k-skeleton of the polytope. Since the cas...
متن کاملLong Monotone Paths on Simple 4-polytopes
TheMonotone Upper Bound Problem (Klee, 1965) asks if the numberM(d, n) of vertices in a monotone path along edges of a d-dimensional polytope with n facets can be as large as conceivably possible: Is M(d, n) = Mubt(d, n), the maximal number of vertices that a d-polytope with n facets can have according to the Upper Bound Theorem? We show that in dimension d = 4, the answer is “yes”, despite the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1973
ISSN: 0095-8956
DOI: 10.1016/0095-8956(73)90032-4